#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N], ans, l = 1, r = 1;
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    ans = n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort (a + 1, a + n + 1);
    a[n + 1] = -1;
    while (r <= n) {
        while (a[l] == a[r]) r++;
        if (r > n) break;
        ans--;
        l++, r++;
    }
    cout << ans << endl;
    return 0;
}